Characterizing $E\sb{3}$ (the largest countable $\Pi \sp{1}\sb{3}$\ set)
نویسندگان
چکیده
منابع مشابه
The Largest Countable Inductive Set is A Mouse Set
Let R be the least ordinal such that L (R) is admissible. Let A = fx 2 R j (9 < R) s.t. x is ordinal deenable in L (R) g. It is well known that (assuming determinacy) A is the largest countable inductive set of reals. Let T be the theory: ZFC Replacement + \There exists ! Woodin cardinals which are coonal in the ordinals." T has consistency strength weaker than that of the theory ZFC + \There e...
متن کاملSequences of characters characterizing countable groups
We show, that for every countable subgroup H of a compact abelian metrizable group G there exists a characterizing sequence of characters (χn)n, i.e. α ∈ H iff ‖χn(α)‖ → 0. The introduced methods allow to answer questions stated in [2] and [9]. Acknowledgements: The authors are very grateful to András Biró and Vera T. Sós for their substantial contributions to this article. Moreover they thank ...
متن کاملStrong characterizing sequences of countable groups
András Biró and Vera Sós prove that for any subgroup G of T generated freely by finitely many generators there is a sequence A ⊆ N such that for all β ∈ T we have (‖.‖ denotes the distance to the nearest integer) β ∈ G ⇒ ∑ n∈A ‖nβ‖ < ∞, β / ∈ G ⇒ lim sup n∈A,n→∞ ‖nβ‖ > 0. We extend this result to arbitrary countable subgroups of T. We also show that not only the sum of norms but the sum of arbi...
متن کاملLimited Set quantifiers over Countable Linear Orderings
In this paper, we study several sublogics of monadic secondorder logic over countable linear orderings, such as first-order logic, firstorder logic on cuts, weak monadic second-order logic, weak monadic second-order logic with cuts, as well as fragments of monadic secondorder logic in which sets have to be well ordered or scattered. We give decidable algebraic characterizations of all these log...
متن کاملMenger's Theorem for a Countable Source Set
Paul Erd} os has conjectured that Menger's theorem extends to innnite graphs in the following way: whenever A; B are two sets of vertices in an innnite graph, there exist a set of disjoint A{B paths and an A{B separator in this graph so that the separator consists of a choice of precisely one vertex from each of the paths. We prove this conjecture for graphs that contain a set of disjoint paths...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1976
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1976-0401476-2